Quantum statistical calculations and symplectic corrector algorithms.
نویسنده
چکیده
The quantum partition function at finite temperature requires computing the trace of the imaginary time propagator. For numerical and Monte Carlo calculations, the propagator is usually split into its kinetic and potential parts. A higher-order splitting will result in a higher-order convergent algorithm. At imaginary time, the kinetic energy propagator is usually the diffusion Green's function. Since diffusion cannot be simulated backward in time, the splitting must maintain the positivity of all intermediate time steps. However, since the trace is invariant under similarity transformations of the propagator, one can use this freedom to "correct" the split propagator to higher order. This use of similarity transforms classically gives rise to symplectic corrector algorithms. The split propagator is the symplectic kernel and the similarity transformation is the corrector. This work proves a generalization of the Sheng-Suzuki theorem: no positive time step propagators with only kinetic and potential operators can be corrected beyond second order. Second-order forward propagators can have fourth-order traces only with the inclusion of an additional commutator. We give detailed derivations of four forward correctable second-order propagators and their minimal correctors.
منابع مشابه
Physics of symplectic integrators: perihelion advances and symplectic corrector algorithms.
Symplectic integrators evolve dynamical systems according to modified Hamiltonians whose error terms are also well-defined Hamiltonians. The error of the algorithm is the sum of each error Hamiltonian's perturbation on the exact solution. When symplectic integrators are applied to the Kepler problem, these error terms cause the orbit to precess. In this work, by developing a general method of c...
متن کاملForward Symplectic Integrators for Solving Gravitational Few-Body Problems
We introduce a class of fourth order symplectic algorithms that are ideal for doing long time integration of gravitational few-body problems. These algorithms have only positive time steps, but require computing the force gradient in additional to the force. We demonstrate the efficiency of these Forward Symplectic Integrators by solving the circularly restricted three-body problem in the space...
متن کاملA Note on Symplectic Algorithms
1. It is well known that the symplectic algorithms [1][2] for the finite dimensional Hamiltonian systems are very powerful and successful in numerical calculations in comparison with other various non-symplectic computational schemes since the symplectic schemes preserve the symplectic structure in certain sense. On the other hand, the Lagrangian formalism is quie useful for the Hanmiltonian sy...
متن کاملSymplectic and energy-conserving algorithms for solving magnetic field trajectories.
The exponential splitting of the classical evolution operator yields symplectic integrators if the canonical Hamiltonian is separable. Similar splitting of the noncanonical evolution operator for a charged particle in a magnetic field produces exact energy-conserving algorithms. The latter algorithms evaluate the magnetic field directly with no need of a vector potential and are more stable wit...
متن کاملAccurate and Eecient Simulation of Rigid Body Rotations Revised Version
This paper introduces eecient and accurate algorithms for simulating the rotation of a three-dimensional rigid object and compares them to several prior methods. The paper considers algorithms which exactly preserve angular momentum and either closely preserve or exactly conserve energy. First, we introduce a second-order accurate method that incorporates a third-order correction; then a third-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 69 4 Pt 2 شماره
صفحات -
تاریخ انتشار 2004